State Constraints Revisited 1
نویسنده
چکیده
We pursue the perspective of Reiter that in the situation calculus one can formalize primitive, determinate actions with axioms which, among others, include two disjoint sets: a set of successor state axioms and a set of action precondition axioms. We posed ourselves the problem of automatically generating successor state axioms, given only a set of e ect axioms and a set of state constraints. This is a special version of what has been traditionally called the rami cation problem. To our surprise, we found that there are state constraints whose role is not to yield indirect e ects of actions. Rather, they are implicit axioms about action preconditions. As such, they are intimately related to the classical quali cation problem. We also discovered that other kinds of state constraints arise; these are related to the formalization of strategic or control information. This paper is devoted to describing our results along these lines, focusing on rami cation and quali cation state constraints. More speci cally, we propose a two step procedure for determining an axiomatization which monotonically solves our versions of the rami cation and quali cation problems. We justify the rst step semantically by appealing to a suitable minimization policy. Step two we justify by simple Clark predicate completion.
منابع مشابه
Clp(intervals) Revisited 1
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive constraints as in CLP(BNR), complex constraints are manipulated as a whole, enabling more sophisticated narrowing procedures to be applied in the solver. This idea is embodied in a new CLP language Newton whose operati...
متن کاملCLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive constraints as in CLP(BNR), complex constraints are manipulated as a whole, enabling more sophisticated narrowing procedures to be applied in the solver. This idea is embodied in a new CLP language Newton whose operati...
متن کاملHigh level Ab inito bench mark computaions on weak interactions (H2)2 dimer revisited
The Potential Energy Surface PES of (H2)2 dimer has been investigated, using five simple rigid rotor models. These models are called: head to head, symmetric side to side, L , steplike and T model. All calculations were done at two levels of ab initio methods: MP2(Full) and QCISD (T,Full) using cc-pVTZ basis set at singlet state of spin multiplicity. The results of scanning PES were then fitte...
متن کاملFischer's Protocol Revisited: A Simple Proof Using Modal Constraints
As a case study, we apply a constraint-oriented state-based proof methodology to Fischer's protocol. The method exploits compo-sitionality and abstraction to reduce the investigated veriication problem. This reduction avoids state space explosion. Key concepts of the reduction process are modal constraints, separation of proof obligations, Skolemization and abstraction. Formal basis for the met...
متن کاملAn Evaluation of The Major Constraints Hampering the Effective Functioning of the Nigerian Agricultural Cooperative and Rural Development Bank in Kogi State, Nigeria
The study evaluated the major constraints hampering the effective functioning of the Nigerian Agricultural Cooperative and Rural Development Bank (NACRDB) in Kogi State, Nigeria. Using the food crop farmers as a case study, a multi-stage random sampling technique was used to select three agricultural zone in Kogi State ( zone A, B, and C).Primary data were collected through the use of structure...
متن کامل